1481. Least Number of Unique Integers after K Removals - LeetCode Solution

class Solution:
    def findLeastNumOfUniqueInts(self, arr: List[int], k: int) -> int:
        dict = {}
        
        for i in arr:
            if i in dict:
                dict[i] +=1
            else:
                dict[i] = 1
        
        nums = []
        print(dict)
        
        for i in dict:
            nums.append([dict[i], i])
        nums.sort()
     
        
        
        while len(nums):
            if k> 0:
                if k- nums[0][0]>= 0:
                    k -= nums[0][0]
                    nums.pop(0)
                 
                else:
                    break
            else:
                break
            
        return len(nums)